Computing selected eigenvalues of sparse unsymmetric matrices using subspace iteration
نویسندگان
چکیده
منابع مشابه
JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices
A new software code for computing selected eigenvalues and associated eigenvectors of a real symmetric matrix is described. The eigenvalues are either the smallest or those closest to some specified target, which may be in the interior of the spectrum. The underlying algorithm combines the Jacobi–Davidson method with efficient multilevel incomplete LU (ILU) preconditioning. Key features are mod...
متن کاملA mathematically simple method based on denition for computing eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices
In this paper, a fundamentally new method, based on the denition, is introduced for numerical computation of eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices. Some examples are provided to show the accuracy and reliability of the proposed method. It is shown that the proposed method gives other sequences than that of existing methods but they still are convergent to th...
متن کاملMultifrontal solution of sparse unsymmetric matrices arising from semiconductor equations
The multifrontal LU method is implemented to solve drift-diffusion models with large sparse matrices arising in the simulation and optimization of semiconductor devices. The performance of this method is compared with the LU algorithm without multifrontal scheme on different computers in the case of a realistic double heterojunction transistor. Résumé On emploie un méthode LU multifrontale pour...
متن کاملPartitioning Rectangular and Structurally Unsymmetric Sparse Matrices for Parallel Processing
A common operation in scientific computing is the multiplication of a sparse, rectangular, or structurally unsymmetric matrix and a vector. In many applications the matrix-transposevector product is also required. This paper addresses the efficient parallelization of these operations. We show that the problem can be expressed in terms of partitioning bipartite graphs. We then introduce several ...
متن کاملA new iteration for computing the eigenvalues of semiseparable (plus diagonal) matrices
This paper proposes a new type of iteration based on a structured rank factorization for computing eigenvalues of semiseparable and semiseparable plus diagonal matrices. Also the case of higher order semiseparability ranks is included. More precisely, instead of the traditional QR-iteration, a QH-iteration will be used. The QH-factorization is characterized by a unitary matrix Q and a Hessenber...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Mathematical Software
سال: 1993
ISSN: 0098-3500,1557-7295
DOI: 10.1145/152613.152614